It was recorded through a two input tape machine onto an 8 track recorder.
2.
The two tapes of a transducer are typically viewed as an input tape and an output tape.
3.
A FST will read a set of strings on the input tape and generates a set of relations on the output tape.
4.
There are two projection functions : \ pi _ 1 preserves the input tape, and \ pi _ 2 preserves the output tape.
5.
Equivalently, 2DFAs can be seen as read-only Turing machines with no work tape, only a read-only input tape.
6.
Line boundaries recorded on the input tape were ignored or retained depending on whether or not an " adjust " key had been selected.
7.
In some sense, if we never " write to " the input tape, we don't want to charge ourself for this space.
8.
Alternatively, pressing " skip " moved past the corresponding amount of text on the input tape without sending it to the typewriter or to the output tape.
9.
Thus we can construct a Turing machine that expects on its tape a string describing an action table followed by a string describing the input tape, and computes the tape that the encoded Turing machine would have computed.
10.
Because Turing machines have the ability to " back up " in their input tape, it is possible for a Turing machine to run for a long time in a way that is not possible with the other computation models previously described.
मोबाइल